Is code equivalence easy to decide?

Is Code Equivalence Easy to Decide?

How easy is code equivalence over F q ?

The linear code equivalence problem is to decide whether two linear codes over Fq are identical up to a linear isometry of the Hamming space. The support splitting algorithm [23] runs in polynomial time for all but a negligible proportion of all linear codes, and solves the latter problem by recovering the isometry when it is just a permutation of the code support. While for a binary alphabet i...

How easy is code equivalence over F q ? * Extended

The linear code equivalence problem is to decide whether two linear codes over Fq are identical up to a linear isometry of the Hamming space. The support splitting algorithm [25] runs in polynomial time for all but a negligible proportion of all linear codes, and solves the latter problem by recovering the isometry when it is just a permutation of the code support. While for a binary alphabet i...

The Hardness of Code Equivalence over Fq and its Application to Code-based Cryptography

The code equivalence problem is to decide whether two linear codes over Fq are identical up to a linear isometry of the Hamming space. In this paper, we review the hardness of code equivalence over Fq due to some recent negative results and argue on the possible implications in code-based cryptography. In particular, we present an improved version of the three-pass identification scheme of Gira...

Functions of Code-Switching Strategies among Iranian EFL Learners and Their Speaking Ability Improvement through Code-Switching

This study investigated the impact of code-switching on speaking ability of Iranian low proficiency EFL learners. Moreover, it was an attempt to show what functions existed behind code-switching strategies used by the EFL learners. To this end, 60 male and female Iranian EFL learners age-ranged between 20 and 30 participated in the study. Data collection instruments which were used were the Int...